Compact bid languages and core-pricing in large multi-object auctions

نویسندگان

  • Andor Goetzendorff
  • Martin Bichler
  • Robert Day
  • Pasha Shabalin
چکیده

Combinatorial auctions address the fundamental problem of allocating multiple items in the presence of complex bidder preferences including complements or substitutes. They have found application in public and private sector auctions. Many real-world markets involve the sale of a large number of items, limiting the direct application of combinatorial auctions due to both computational intractability for the auctioneer and communication difficulty for the bidders. More specifically for the latter, an enumerative XOR bidding language (widely discussed in the literature and used in recent government spectrum auctions) grows too quickly to be practical. Market designs for large markets with many items and similar incentive properties have previously received little attention in the literature. We introduce an auction design framework for large markets with hundreds of items and complex bidder preferences. The framework comprises compact bid languages in a sealed-bid auction and methods to compute second-price rules such as the Vickrey-ClarkeGroves or bidder-optimal, core-selecting payment rules. The latter have been introduced in spectrum auctions worldwide as a means to encourage incentives for truthful bidding, but at the same time avoid some problems of the Vickrey-Clarke-Groves mechanism. We discuss compact bidding languages for TV ads markets and volume-discount procurement auctions, and investigate the resulting winner-determination problem and the computation of core payments. For realistic instances of the respective winner determination problems, very good solutions with a small integrality gap can be found quickly, though closing the integrality gap to find marginally better solutions or prove optimality can take a prohibitively large amount of time. Our subsequent adaptation of a constraint-generation technique for the computation of bidder-optimal core paymants to this environment is a new, practically viable paradigm by which core-selecting auction designs can be applied to large markets with potentially hundreds of items.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Designing multi-unit multiple bid auctions: An agent-based computational model of uniform, discriminatory and generalized Vickrey auctions

Multi-unit auctions are being employed by public agencies to allocate resources and to purchase services. These auctions resolve the lumpy bid problem inherent in single-unit auctions by allowing bidders to submit a supply or demand schedule. However, the choice of pricing formats for multi-unit auctions is controversial. Neither economic theory nor laboratory experiments depict a complete pict...

متن کامل

Core-pricing in large multi-object auctions: a market design for selling TV-ads

We introduce an auction design and computational methods to determine core payments for large markets with many objects such as the market for TV ads. Bidder optimal, core-selecting auctions have been introduced in spectrum auctions worldwide as a means to set incentives for truthful bidding, but at the same time avoid the problems of the Vickrey-Clarke-Groves mechanism. Many real-world markets...

متن کامل

From the Assignment Model to Multi-object Auctions

The exposition will be divided into static and dynamic parts. By “static,” we shall mean the characterization of a multi-unit, multi-object sealed-bid auction as a pricing equilibrium. Pricing equilibria correspond to optimal solutions to the primal and dual of a certain linear programming (LP) problem. We shall give necessary and sufficient conditions, called buyers are substitutes (formulated...

متن کامل

A comparison of first price multi-object auctions

We compare multi-object English-type ascending price auctions with first price sealed bid auctions in private values environments with multi-object demands. Special attention is paid to the effect of closing rules on ascending auctions’ outcomes. JEL classification code: C92, D44

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014